Travelling salesman problem - PDFSEARCH.IO - Document Search Engine

Travelling salesman problem
Results: 321

#	Item
111	CCCG 2010, Winnipeg MB, August 9–11, 2010 Constrained k-center and Movement to Independence Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Approximation algorithm Computational complexity theory Facility location Circle Travelling salesman problem Tower of Hanoi Theoretical computer science Geometry Mathematics
112	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, 1 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:16 Polygons NP-complete problems Computational geometry Operations research 3D computer graphics Art gallery problem Simple polygon Travelling salesman problem Visibility Geometry Mathematics Theoretical computer science
113	PDF Document Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2013-06-23 23:45:38 Diophantine approximation Monte Carlo methods Operations research Low-discrepancy sequence Quasi-Monte Carlo method Halton sequence Algorithm Travelling salesman problem Dynamic programming Mathematics Applied mathematics Numerical analysis
114	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:31 Mathematics Mathematical optimization NP-complete problems Computational complexity theory Travelling salesman problem Stochastic optimization Job shop scheduling Ant colony optimization algorithms Dynamic programming Theoretical computer science Operations research Applied mathematics
115	Hybrid Queueing Theory and Scheduling Models for Dynamic Environments with Sequence-Dependent Setup Times Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2013-11-29 11:22:44 Applied mathematics Job shop scheduling Sequence-dependent setup Scheduling Queueing theory Ant colony optimization algorithms Queueing model Travelling salesman problem Operations research Statistics Mathematical sciences
116	A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics T-H. Hubert Chan∗ Abstract We consider the Traveling Salesman Problem with Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2009-09-30 04:49:48 Data mining Machine learning Operations research Travelling salesman problem Nearest neighbor search Metric space Point location Euclidean geometry Mathematics Information science Geometry
117	Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) Euc Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2007-10-10 14:10:39 Metric geometry Dimension theory Fractals Machine learning Mathematical analysis Travelling salesman problem Tree decomposition Ε-net Nearest neighbor search Mathematics Theoretical computer science Geometry
118	Logic-based Benders Decomposition for Alternative Resource Scheduling with Sequence Dependent Setups Tony T. Tran and J. Christopher Beck1 Abstract. We study an unrelated parallel machines scheduling problem with sequenc Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2012-12-18 10:57:27 Mathematical optimization Theoretical computer science Job shop scheduling Sequence-dependent setup Travelling salesman problem Optimization problem Ant colony optimization algorithms Multiprocessor scheduling Algorithm Operations research Applied mathematics Mathematics
119	arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-07-06 20:12:57 Matching Eulerian path Petersen graph Travelling salesman problem Graph Tree Chordal graph Hamiltonian path Planar graph Graph theory NP-complete problems Cubic graph
120	CS109B Notes for LectureConnected Components In an undirected graph, the relation uCv i there is a path from u to v is an equivalence relation (see FCS, p. 467). Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:38 Spanning tree Travelling salesman problem Connectivity Reverse-delete algorithm Minimum spanning tree Graph theory Theoretical computer science Mathematics

UPDATE